Dynamic Generation and Prefetching of Data Tiles for Exploratory Visualization

ثبت نشده
چکیده

With many current visualization systems, users must manually throw data away until it fits in memory, before they can visualize it. We propose instead to expose this resource-latency tradeoff to the user directly, by allowing the user to specify resource constraints and have the system adjust automatically. In this poster, we present ForeCache, an exploration system that visualizes aggregated views of datasets stored in a DBMS. We implemented a number of server-side techniques in ForeCache for prefetching small subsets of aggregated data (i.e. chunks) for fast visualization of large datasets. Our techniques leverage locality in the user’s exploratory behavior, and improve upon existing techniques in two ways. First, instead of pre-computing all data chunks in advance, we reduce storage requirements by only pre-computing a subset of chunks in advance, and computing the remaining chunks at runtime as needed. Second, we balance runtime computation costs by predictively building and caching new data chunks in anticipation of the user’s needs.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Global User-Driven Model for Tile Prefetching in Web Geographical Information Systems

A web geographical information system is a typical service-intensive application. Tile prefetching and cache replacement can improve cache hit ratios by proactively fetching tiles from storage and replacing the appropriate tiles from the high-speed cache buffer without waiting for a client's requests, which reduces disk latency and improves system access performance. Most popular prefetching st...

متن کامل

Robustness of a Neighbor Selection Markov Chain in Prefetching Tiled Web Data

The service speed of tiled-web data such as a map can be improved by prefetching future tiles while the current one is being displayed. Traditional prefetching techniques examine the transition probabilities among the tiles to predict the next tile to be requested. However, when the tile space is very huge, and a large portion of it is accessed with even distribution, it is very costly to monit...

متن کامل

Adaptation of a Neighbor Selection Markov Chain for Prefetching Tiled Web GIS Data

With the growth of internet usage, many kinds of useful data are served in the internet. Geographic data such as a map is one of them. However since geographic data is usually very huge, it needs special treatment in serving. One useful technique is tiling. For example, a map is divided into smaller pieces called a tile, and served tile by tile. Since the client usually requests several tiles i...

متن کامل

The Hiperwall Visualization Platform for Big Data Research

In the era of Big Data, with the increasing use of large-scale datadriven applications, the visualization of very large high-resolution images and extracting useful information (searching for specific targets or rare signal events) from these images can pose challenges to the current video-wall display technologies. At Bellarmine University, we have set up an Advanced Visualization and Computat...

متن کامل

Scalable Visual Hierarchy Exploration

More and more modern computer applications, from business decision support to scientific data analysis, utilize visualization techniques to support exploratory activities. Most visualization tools do not scale well with regard to the size of the dataset upon which they operate. Specifically, the level of cluttering on the screen is typically unacceptable and the performance is poor. To solve th...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2014